degenerate subgraph

См. также в других словарях:

• Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

• Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… …   Wikipedia

• Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… …   Wikipedia

• Degree (graph theory) — A graph with vertices labeled by degree In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex …   Wikipedia

• Neil J. Gunther — Neil James Gunther Neil Gunther at Bletchley Park 2002 A quantum leap is neither Born …   Wikipedia

• Möbius configuration — Example of Möbius configuration; the face planes of red tetrahedron are shown on the top of the image; the blue one on the bottom. The vertex coordinates of the red tetrahedron are: (0,0,0),(0,0,1),(0,1,0),(1,0,0). The vertex coordinates of the… …   Wikipedia